//题目链接：https://www.nowcoder.com/practice/99eb8040d116414ea3296467ce81cbbc?tpId=230&tqId=38962&ru=/exam/oj
#include <iostream>
using namespace std;
const int N = 1010;
long long s[N][N];
int a[N][N];
int n, m, q;

int main() {
    scanf("%d%d%d", &n, &m, &q);
    for (int i = 1 ; i <= n ; ++i) 
        for (int j = 1 ; j <= m ; ++j) 
            scanf("%d",&a[i][j]);
    for(int i = 1 ; i <= n ; ++i)
        for(int j = 1 ; j <= m ; ++j)
            s[i][j] = a[i][j] + s[i-1][j] + s[i][j-1] - s[i-1][j-1];
    while (q--) {
        int x1, x2, y1, y2;
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        printf("%lld\n", s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]);
    }
}
// 64 位输出请用 printf("%lld")